TSTP Solution File: CSR136^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 10:29:44 EDT 2024
% Result : Theorem 9.65s 2.83s
% Output : Refutation 9.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 15 unt; 5 typ; 0 def)
% Number of atoms : 30 ( 8 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 189 ( 35 ~; 24 |; 6 &; 124 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 0 ^ 39 !; 3 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(num_type,type,
num: $tType ).
thf(lBill_THFTYPE_i_type,type,
lBill_THFTYPE_i: $i ).
thf(lMary_THFTYPE_i_type,type,
lMary_THFTYPE_i: $i ).
thf(lSue_THFTYPE_i_type,type,
lSue_THFTYPE_i: $i ).
thf(likes_THFTYPE_IiioI_type,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(1,conjecture,
? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(11,plain,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C ) ),
inference(cnf,[status(esa)],[11]) ).
thf(4,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(14,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(15,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(polarity_switch,[status(thm)],[14]) ).
thf(33,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( A @ B @ C )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[12,15]) ).
thf(54,plain,
( ~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(pre_uni,[status(thm)],[33:[bind(A,$thf( ^ [D: $i] : ^ [E: $i] : ( likes_THFTYPE_IiioI @ E @ lMary_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( lSue_THFTYPE_i ))]]) ).
thf(91,plain,
~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i ),
inference(simp,[status(thm)],[54]) ).
thf(3,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(13,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(43,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ~ ~ ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ~ ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( C @ A @ B ) ),
inference(prim_subst,[status(thm)],[12:[bind(A,$thf( ^ [E: $i] : ^ [F: $i] : ~ ( D @ E @ F ) ))]]) ).
thf(84,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ~ ( C @ A @ B )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(cnf,[status(esa)],[43]) ).
thf(85,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ~ ( C @ A @ B )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(simp,[status(thm)],[84]) ).
thf(148,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( C @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[13,85]) ).
thf(204,plain,
( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(pre_uni,[status(thm)],[148:[bind(A,$thf( A )),bind(B,$thf( lSue_THFTYPE_i )),bind(C,$thf( ^ [D: $i] : ^ [E: $i] : ( likes_THFTYPE_IiioI @ E @ lBill_THFTYPE_i ) ))]]) ).
thf(217,plain,
likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i,
inference(simp,[status(thm)],[204]) ).
thf(34,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[12]) ).
thf(62,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[34:[]]) ).
thf(63,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[62:[]]) ).
thf(1421,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[217,63]) ).
thf(1544,plain,
! [A: $i] :
( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A )
| ( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
!= ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[1421:[bind(A,$thf( ^ [D: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( C ))]]) ).
thf(1548,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A ),
inference(pattern_uni,[status(thm)],[1544:[]]) ).
thf(1562,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A ),
inference(simp,[status(thm)],[1548]) ).
thf(1681,plain,
~ $true,
inference(rewrite,[status(thm)],[91,1562]) ).
thf(1682,plain,
$false,
inference(simp,[status(thm)],[1681]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% 0.16/0.16 % Command : run_Leo-III %s %d
% 0.17/0.37 % Computer : n005.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon May 6 23:31:09 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.92/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/0.98 % [INFO] Parsing done (118ms).
% 1.30/0.98 % [INFO] Running in sequential loop mode.
% 1.67/1.19 % [INFO] nitpick registered as external prover.
% 1.67/1.19 % [INFO] Scanning for conjecture ...
% 1.83/1.25 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 1.88/1.27 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.88/1.27 % [INFO] Problem is higher-order (TPTP THF).
% 1.88/1.28 % [INFO] Type checking passed.
% 1.88/1.28 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 9.65/2.83 % [INFO] Killing All external provers ...
% 9.65/2.83 % Time passed: 2292ms (effective reasoning time: 1839ms)
% 9.65/2.83 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 9.65/2.83 % Axioms used in derivation (2): ax_001, ax
% 9.65/2.83 % No. of inferences in proof: 27
% 9.65/2.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2292 ms resp. 1839 ms w/o parsing
% 9.65/2.86 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.65/2.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------